Asymmetric Cryptosystems
نویسندگان
چکیده
Throughout the history of cryptography, hundreds of cryptosystems have been developed. The earliest ones, as well as many later ones, relied on the complete secrecy in transferring keys between the sender and recipient. These kinds of systems, called secret key cryptosystem, have just a single key which is used for both encryption and decryption; therefore, these systems are more frequently known as symmetric cryptosystems. In contrast to a symmetric cryptosystem, an asymmetric cryptosystem is associated with a pair of keys; therefore, not everything related to the cryptosystem needs to be kept secret. This kind of a cryptosystem is also called public-key cryptosystem. A public key cryptosystem consists of a public key, which is used for encryption, and a private key, used for decryption. Therefore, anybody can encrypt plaintext since the encryption key is available to everyone, but only the holders of the private key corresponding to the public key used for encryption can decrypt the ciphertext [2]. The first asymmetric cryptosystems appeared in 1970s to address the problem of key management in symmetric cryptography. In 1976, Whitfield Diffie and Martin Hellman published a key management scheme that was the predecessor to the first public-key cryptosystems; it later became known as the DiffieHellman Key Exchange Protocol. Later, several asymmetric cryptosystems were developed, including ElGamal, Rabin, and RSA cryptosystems ([2], [1]).
منابع مشابه
Public - Key Cryptanalysis Phong Q . Nguyen
In 1976, Diffie and Hellman introduced the revolutionary concept of public-key cryptography, also known as asymmetric cryptography. Today, asymmetric cryptography is routinely used to secure the Internet. The most famous and most widely used asymmetric cryptosystem is RSA, invented by Rivest, Shamir and Adleman. Surprisingly, there are very few alternatives known, and most of them are also base...
متن کاملPerformance and analysis of NTRU and Advanced NTRU cryptosystems
Authentication and Confidentiality is the main goal of the public key cryptosystems deal when communication takes place between both the parties. The mostly used cryptographic methods are broadly classified as symmetric and asymmetric. The DES comes under the category of symmetric key cryptosystem whereas RSA, NTRU[1] belongs to the category of asymmetric key cryptosystem. NTRU (Nth degree trun...
متن کاملAutomated Proofs for Asymmetric Encryption: First results in the random oracle model
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower level of security have been proposed. Providing security proofs has also become standard practice. There is, however, a lack of automated verification procedures that analyse such cryptosystems and provide security p...
متن کاملNew Generic Design to Expedite Asymmetric Cryptosystems Using Three-levels of Parallelism
Public key cryptosystems depend on complex and time consuming arithmetic operations. Public key cryptosystems require modular operations over large numbers or finite fields. Researchers are working on improving the performance of asymmetric cryptosystems while maintaining the security of the cryptographic algorithms. Parallel computing is the most promising solution to improve the computing pow...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کامل